/*
 * Copyright 2014 CITIUS <http://citius.usc.es>, University of Santiago de Compostela.
 *
 *    Licensed under the Apache License, Version 2.0 (the "License");
 *    you may not use this file except in compliance with the License.
 *    You may obtain a copy of the License at
 *
 *        http://www.apache.org/licenses/LICENSE-2.0
 *
 *    Unless required by applicable law or agreed to in writing, software
 *    distributed under the License is distributed on an "AS IS" BASIS,
 *    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *    See the License for the specific language governing permissions and
 *    limitations under the License.
 */

package es.usc.citius.hipster.graph;

/**
 * A simple representation of a directed graph with two methods for
 * retrieving the outgoing edges and the incoming edges for a vertex.
 * @param <V> vertex type.
 * @param <E> edge type.
 */
public interface HipsterDirectedGraph<V,E> extends HipsterGraph<V,E> {
    Iterable<GraphEdge<V,E>> outgoingEdgesOf(V vertex);
    Iterable<GraphEdge<V,E>> incomingEdgesOf(V vertex);
}
